Computational Power of Static Watson-Crick Context-free Grammars

Watson-Crick D0L systems: the power of one transition

We investigate the class of functions computable by uni-transitional Watson–Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the class, and show that the basic decision problems are equivalent or harder than a celebrated open...

On the power of parallel communicating Watson-Crick automata systems

Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...

Power and size of extended Watson-Crick L systems

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

Restricted deterministic Watson-Crick automata

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...